Semantic Equivalence of Task-Oriented Programs in TopHat

Abstract Task-oriented programming ( top ) is a new paradigm for specifying multi-user workflows. To reason formally about programs, formal language called TopHat has been designed, together with its operational semantics. For proving properties task-oriented it desirable to know when two -programs are semantically equivalent. This paper aims answer this question. We show that task can be in either one of five conditions, and every tasks the same condition, we define what means them Using definition, study number transformation laws -programs, which used by developers compilers optimise -programs. "Image missing"operation on types functor but cannot monad. support our findings proofs formalised dependently typed Idris .